S-leach: a Sequential Selection Approach to Elect Cluster Heads for Leach Protocol

نویسندگان

  • Ankit Thakkar
  • Ketan Kotecha
چکیده

Wireless Sensor Nodes are deployed in the hostile region to help the user by providing data to the user for the review purpose. These nodes are having limited power as they are battery operated. Hence, routing protocol used to deliver data to end users must be energy efficient to provide prolonged network lifetime. In this paper, we have proposed a decentralized clustering scheme based on sequential selection (S-LEACH) that maintains desired number of cluster heads during each round until the death of first node. Extensive simulations are carried out to compare our proposed protocol with three well known protocols LEACH (Low Energy Adaptive Clustering Hierarchy), LDCHS (Low Energy Clustering Hierarchy with Deterministic Cluster Head Selection) and ALEACH (Advanced LEACH). Simulation results show that S-LEACH outperforms to the LEACH, LDCHS and ALEACH protocols.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

Leach Routing Algorithm Optimization through Imperialist Approach

Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...

متن کامل

LEACH-G: an Optimal Cluster-heads Selection Algorithm based on LEACH

As a classic clustering algorithm, LEACH is widely used in wireless sensor networks. Due to the random cluster head selection process, LEACH does not guarantee optimization for the number and position of cluster heads. In order to further optimize LEACH, an optimal energyefficient cluster-heads selection algorithm LEACH-G for LEACH protocol is presented. We calculate the optimal number of clust...

متن کامل

A Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks

Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...

متن کامل

W F - MCHEL : Fuzzy Based Master Cluster Head Election

Wireless Sensor Network is the network of powerlimited sensing devices called sensors deployed in a region to sense various types of physical information from the environment when these sensors sense and transmit data to other sensors present in the network; considerable amount of energy is dissipated. In this paper, an effort has been done to propose F-MCHEL, a homogeneous energy protocol. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014